High Speed Homology Search with FPGAs

نویسندگان

  • Yoshiki Yamaguchi
  • Tsutomu Maruyama
  • Akihiko Konagaya
چکیده

We will introduce a way how we can achieve high speed homology search by only adding one off-the-shelf PCI board with one Field Programmable Gate Array (FPGA) to a Pentium based computer system in use. FPGA is a reconfigurable device, and any kind of circuits, such as pattern matching program, can be realized in a moment. The performance is almost proportional to the size of FPGA which is used in the system, and FPGAs are becoming larger and larger following Moore's law. We can easily obtain latest/larger FPGAs in the form off-the-shelf PCI boards with FPGAs, at low costs. The result which we obtained is as follows. The performance is most comparable with small to middle class dedicated hardware systems when we use a board with one of the latest FPGAs and the performance can be furthermore accelerated by using more number of FPGA boards. The time for comparing a query sequence of 2,048 elements with a database sequence of 64 million elements by the Smith-Waterman algorithm is about 34 sec, which is about 330 times faster than a desktop computer with a 1 GHz Pentium III. We can also accelerate the performance of a laptop computer using a PC card with one smaller FPGA. The time for comparing a query sequence (1,024) with the database sequence (64 million) is about 185 sec, which is about 30 times faster than the desktop computer.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Comparison of Heuristics for FPGA Placement

Field-Programmable Gate Arrays (FPGAs) are digital integrated circuits (ICs) that contain configurable logic and interconnect to provide a means for fast prototyping and also for a cost-effective chip design. The innovative development of FPGAs spurred the invention of a new field in which many different hardware algorithms could execute on a single device [16]. Efficient Computer Aided Design ...

متن کامل

Modern Homology Search

Dynamic programming [1] has full sensitivity, but too slow for large scale homology search. FASTA / BLAST type of heuristics [2] trade sensitivity for speed. Can we have both sensitivity and speed? We present the mathematical theory of optimized spaced seeds which allows modern homology search to achieve high sensitivity and high speed simultaneously. The spaced seed methodology is implemented ...

متن کامل

Multi-ghz Sige Bicmos Fpgas with New Architecture and Novel Power Management Techniques

The availability of Silicon Germanium (SiGe) Heterojunction Bipolar Tkansistor (HBT) devices has opened a door for GHz Field Programmable Gate Arrays (FPGAs).ls2 The integration of high-speed SiGe HBTs and low-power CMOS gives a significant speed advantage t o SiGe FPGAs over CMOS FPGAs. In the past, high static power consump tion discouraged the pursuit of bipolar FPGAs from being scaled up si...

متن کامل

DSPs/FPGAs Comparative Study for Power Consumption, Noise Cancellation, and Real Time High Speed Applications

Adaptive noise data filtering in real-time requires dedicated hardware to meet demanding time requirements. Both DSP processors and FPGAs were studied with respect to their performance in power consumption, hardware architecture, and speed for real time applications. For testing purposes, real time adaptive noise filters have been implemented and simulated on two different platforms, Motorola D...

متن کامل

Fast DES Implementation for FPGAs and Its Application to a Universal Key-Search Machine

Most modern security protocols and security applications are deened to be algorithm independent, that is, they allow a choice from a set of cryptographic algorithms for the same function. Therefore a key-search machine which is also deened to be algorithm independent might be interesting. We researched the feasibility of a universal key-search machine using the Data Encryption Standard (DES) as...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing

دوره   شماره 

صفحات  -

تاریخ انتشار 2002